<HTML><HEAD><TITLE>biconnected_components(+Graph, -Articulations, -BCC)</TITLE>
</HEAD><BODY>[ <A HREF="index.html">library(graph_algorithms)</A> | <A HREF="../../index.html">Reference Manual</A> | <A HREF="../../fullindex.html">Alphabetic Index</A> ]
<H1>biconnected_components(+Graph, -Articulations, -BCC)</H1>
Finds the biconnected components of the graph
<DL>
<DT><EM>Graph</EM></DT>
<DD>a graph structure
</DD>
<DT><EM>Articulations</EM></DT>
<DD>a list of integer node numbers
</DD>
<DT><EM>BCC</EM></DT>
<DD>list of lists of integer node numbers
</DD>
</DL>
<H2>Description</H2>
<P>
    Computes the biconnected components of a graph, i.e. maximal subsets of
    the graph's nodes whose nodes are mutually accessible via at least two
    distinct paths (in other words, subgraphs which have no articulation
    points).
<P></P>
    Also compute a list of articulation points, i.e. those nodes that
    connect the biconnected components to each other.
<P></P>
    This operation is only defined for bidirected graphs.
<P></P>
    Note that by convention, isolated nodes and pairs of nodes connected
    by a single (bidirected) edge also form biconnected components.
    </P>
<H3>Modes and Determinism</H3><UL>
<LI>biconnected_components(+, -, -) is det
</UL>
<H2>See Also</H2>
<A HREF="../../lib/graph_algorithms/graph_is_bidirected-1.html">graph_is_bidirected / 1</A>, <A HREF="../../lib/graph_algorithms/articulation_points-2.html">articulation_points / 2</A>, <A HREF="../../lib/graph_algorithms/strong_components-2.html">strong_components / 2</A>
</BODY></HTML>
